Deriving Real-Time Programs from Duration Calculus Specifications

نویسندگان

  • François Siewe
  • Dang Van Hung
چکیده

In this paper we present a syntactical approach for deriving real-time programs from a formal specification of the requirements of real-time systems. The main idea of our approach is to model discretization at state level by introducing the discrete states approximating the continuous ones, and then derive a specification of the control program over discrete states. Then the control program is derived from its specification using an extension of Hoare triples to real-time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesizing Controllers from Real-Time Specifications - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

We present an algorithm for synthesizing real-time controllers specified in a subset of the interval temporal logic duration calculus. The synthesized controllers are given in terms of programmable logic controller (PLC)-automata, which are an abstract description of programs of polling machines. PLCautomata can be implemented directly on PLC’s, a special kind of polling real-time controllers t...

متن کامل

Decomposing Real-Time Specifications

In this paper we show that every real-time system speciied in a certain subset of Duration Calculus 24] can be decomposed into an untimed system communicating with suitable timers. Both asynchronous and synchronous communication are considered.

متن کامل

Projections: A Technique for Verifying Real-Time Programs in Duration Calculus

We present a technique for handling the true synchrony hypothesis and (infinite) loops in real-time programming. The technique is based on the notion of projections and iterations in Duration Calculus. With this technique, the semantics of real-time programs with shared variables is given in a simple way, and the verification can be done using DC∗ proof system.

متن کامل

A refinement calculus for logic programs

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constr...

متن کامل

A Higher-Order Duration Calculus and Its Completeness

This paper studies how to describe the real-time behaviour of programs using Duration Calculus. Since program variables are interpreted as functions over time in real-time programming, and it is inevitable to introduce quantifications over program variables in order to describe local variable declaration and declare local channel and so on, therefore, to establish a higher-order duration calcul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001